Resource Augmentation Analysis on Deadline Scheduling with Malleable Tasks

Deadline Scheduling of Multiprocessor Tasks

In the classical scheduling theory it is widely assumed that any task requires for its processing only one processor at a time. Nowadays with the technological progress this assumption has become not so obvious. In the paper, two algorithms for solving the problem of scheduling tasks requiring more than one processor at a time in the real-time environment, will be given. The first is based on a...

Algorithms for Scheduling Malleable Cloud Tasks

Due to the ubiquity of batch data processing in cloud computing, the related problem of scheduling malleable batch tasks and its extensions have received significant attention recently. In this paper, we consider a fundamental model where a set of n tasks is to be processed on C identical machines and each task is specified by a value, a workload, a deadline and a parallelism bound. Within the ...

Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan

The problem of optimal scheduling n tasks in a parallel processor system is studied. The tasks are malleable, i.e., a task may be executed by several processors simultaneously and the processing speed of a task is a nonlinear function of the number of processors allocated to it. The total number of processors is m and it is an upper bound on the number of processors that can be used by all the ...

Scheduling malleable tasks with interdependent processing rates: Comments and observations

In this short paper we examine the problem of scheduling malleable tasks on parallel processors. One of the main aims of the paper is to present a simple complexity interpretation for a number of results for cases with convex and concave processing speed functions. The contribution of this paper is a new unified view of results described in several recent papers. We briefly discuss the implicat...

A Tighter Extra-Resource Analysis of Online Deadline Scheduling